Method and apparatus for information management

ABSTRACT

An information management apparatus manages systems each storing key-data pairs, each including a key obtained by applying a predetermined function and data associated with the key, so as to be distributed among nodes, and includes a storing unit for storing a management table that stores information on an identifier common to systems, a key assigned to the identifier, and nodes assigned to the identifier; and a control unit for extracting, from a node pool housing nodes unassigned to any of the systems, as many nodes as the number of systems when the number of nodes in the node pool is equal to or larger than that of systems, assigning, in association with an identifier common to the systems, each of the extracted nodes to the individual systems, assigning a key to the identifier, and updating the management table according to the node and key assignment.

CROSS-REFERENCE TO RELATED APPLICATION

This application is based upon and claims the benefit of priority of the prior Japanese Patent Application No. 2016-116159, filed on Jun. 10, 2016, the entire contents of which are incorporated herein by reference.

FIELD

The embodiments discussed herein are related to a method and apparatus for information management.

BACKGROUND

The Internet of Things (IoT) is widely and increasingly prevalent, which provides communication capabilities to various devices in the world to thereby allow the devices to perform remote measurements and realize the utilization of information collected from them. In the use of the IoT technology, there are needs for the development of technologies enabling more efficient management of vast amounts of information collected by various kinds of devices and faster search for desired information.

In order to manage vast amount of information with great efficiency, there is a technology called autonomous distributed key-value store (KVS), which stores information pieces (values), each associated with a single key used in search operations, in a distributed manner across a plurality of locations (nodes). In such an autonomous distributed KVS system, an algorithm such as a Distributed Hash Table (DHT) or a Skip Graph is used in order to uniquely determine a node responsible for storing key-value pairs to thereby allow a search for the value associated with a given key.

In Chord, a DHT-based implementation, for example, each node is assigned, based on predetermined rules, to one of a plurality of identifiers (ID's) set in advance, and each key is assigned to a node according to the node assignment to the individual identifiers. That is, the node assignment and key assignment made in association with a node entry to or exit from the autonomous distributed KVS system are determined autonomously. Therefore, the autonomous distributed KVS system supports straightforward addition and removal of nodes, thereby providing high scalability.

There is a proposed method of achieving data redundancy in a system for managing m-digit continuous numerical values in association with management key values by means of dividing the range of the continuous numerical values into a plurality of sections, creating as many replications of each pair of a management key and data as the number of sections, and storing the replications across a plurality of nodes. In addition, there is a proposed method of determining, in storing registration information pieces each including a key and original data of a data item corresponding to the key in DHT nodes, the order of the registration information pieces according to hash values of the keys and determining registration information pieces to be stored in the same node based on the determined order. Further, there is a proposed method where a single master node distributes identifiers uniquely associated with individual data pieces to slave nodes.

International Publication Pamphlet No. WO 2013027784

Japanese Laid-open Patent Publication No. 2011-198199

Japanese Laid-open Patent Publication No. 2009-20757

Japanese Laid-open Patent Publication No. 2012-178025

David Karger et al., “Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web”, Proceedings of the twenty-ninth annual ACM symposium on Theory of computing (STOC '97), May 1997

In an autonomous distributed KVS system, key-value (KV) pairs stored in a node are lost as the node exits. Therefore, the autonomous distributed KVS system replicates key-value pairs and stores the copies in a plurality of nodes, as in the above-mentioned proposed technique of Karger et al., to thereby prevent the loss of the key-value pairs. However, frequent node entries and exits involve frequent replication of key-value pairs to different nodes, thus resulting in high communication load between nodes (inter-node communication load).

In addition, each node entry or exit entails an update of information used for node searching. Therefore, frequent node entries and exits lead to high processing load of nodes. For these reasons, in the case where, for example, mobile terminals likely to frequently enter and exit a system serve as nodes, the inter-node communication load and the processing load of nodes may be increased, which is likely to result in decreased performance of the system.

SUMMARY

According to one embodiment, there is provided a non-transitory computer-readable storage medium storing an information management program that causes a processor of a computer including a memory and the processor to perform a procedure. The procedure includes storing, in a management table residing in the memory and used to manage a system among a plurality of systems, each of which stores key-data pairs in such a way as to be distributed among a plurality of nodes, information on an identifier common to the systems, one or more keys assigned to the common identifier, and nodes assigned to the common identifier, the key-data pairs each including a key obtained by application of a predetermined function and data associated with the key; and extracting, from a node pool housing a set of nodes each unassigned to any of the systems, as many nodes as a number of systems when a number of nodes housed in the node pool is equal to or larger than the number of systems, assigning, in association with an identifier common to the systems, each of the extracted nodes to a different one of the systems, assigning one or more keys to the common identifier, and then updating the management table according to the assigning of the extracted nodes and the assigning of the one or more keys.

The object and advantages of the invention will be realized and attained by means of the elements and combinations particularly pointed out in the claims.

It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory and are not restrictive of the invention.

BRIEF DESCRIPTION OF DRAWINGS

FIG. 1 illustrates an example of an information management device according to a first embodiment;

FIG. 2 is a first diagram illustrating an example of an autonomous distributed KVS system (Chord);

FIG. 3 is a second diagram illustrating the example of the autonomous distributed KVS system (Chord);

FIG. 4 is a third diagram illustrating the example of the autonomous distributed KVS system (Chord);

FIG. 5 illustrates an example of a multiple distributed KVS system according to a second embodiment;

FIG. 6 illustrates node management taking place in the multiple distributed KVS system according to the second embodiment;

FIG. 7 illustrates an example of a routing table held in each node according to the second embodiment;

FIG. 8 illustrates an example of hardware capable of implementing functions of the node according to the second embodiment;

FIG. 9 is a block diagram illustrating an example of functions of an initial node according to the second embodiment;

FIG. 10 illustrates an example of a transaction history according to the second embodiment;

FIG. 11 illustrates an example of the routing table according to the second embodiment;

FIG. 12 illustrates an example of an initial node list according to the second embodiment;

FIG. 13 illustrates an example of a same identifier node list according to the second embodiment;

FIG. 14 illustrates an example of node pool information according to the second embodiment;

FIG. 15 illustrates an example of RTT data according to the second embodiment;

FIG. 16 is a block diagram illustrating an example of functions of a normal node according to the second embodiment;

FIG. 17 illustrates a node assignment method according to the second embodiment;

FIG. 18 is a flow diagram illustrating a processing sequence taking place at the time of a node entry according to the second embodiment;

FIG. 19 is a flow diagram illustrating a processing sequence taking place in association with receiving a KVS transaction request according to the second embodiment;

FIG. 20 illustrates synchronization and alive monitoring processing according to the second embodiment;

FIG. 21 is a first sequence diagram illustrating the synchronization and alive monitoring processing according to the second embodiment;

FIG. 22 is a second sequence diagram illustrating the synchronization and alive monitoring processing according to the second embodiment;

FIG. 23 illustrates re-entry and synchronization processing according to the second embodiment;

FIG. 24 is a sequence diagram illustrating a sequence of the re-entry and synchronization processing according to the second embodiment; and

FIG. 25 is a flow diagram illustrating a processing sequence taking place at the time of RTT measurement according to the second embodiment.

DESCRIPTION OF EMBODIMENTS

Several embodiments will be described below with reference to the accompanying drawings. In the following description and the accompanying drawings, like reference numerals refer to like elements having substantially the same functions, and a repeated description thereof may be omitted.

(a) First Embodiment

A first embodiment is described next with reference to FIG. 1. The first embodiment is directed to a technique for preventing the loss of information due to a node exit in a system implementing an autonomous distributed KVS using, for example, a DHT. The first embodiment further relates to a mechanism for reducing inter-node communication load and processing load of nodes at the time of each node exit even if there are nodes likely to frequently repeat system entries and exits.

Note that FIG. 1 illustrates an example of an information management device according to the first embodiment. An information management device 10 of FIG. 1 is one such example of the first embodiment. In addition, the information management device 10 is one of nodes responsible for managing node entries and exits. Nodes responsible for managing node entries and exits are hereinafter referred to as “initial nodes”. In the example of FIG. 1, the information management device 10 corresponds to a node N01.

As illustrated in FIG. 1, the information management device 10 includes a storing unit 11 and a control unit 12. The storing unit 11 is a volatile storage device such as random access memory (RAM), or a non-volatile storage device such as a hard disk drive (HDD) or flash memory. The control unit 12 is a processor such as a central processing unit (CPU) or digital signal processor (DSP). Note however that the control unit 12 may be an electronic circuit, such as an application specific integrated circuit (ASIC) or field programmable gate array (FPGA). The control unit 12 executes a program stored, for example, in the storing unit 11 or different memory.

The information management device 10 manages nodes. Each node stores therein information corresponding to one or more keys assigned to the node (a management table 11 a). The nodes are, for example, mobile terminals such as mobile phones and smartphones, in-vehicle terminals such as car navigation systems, or information processors such as personal computers and servers. In addition, each node has a function of communicating with other nodes using a network, such as a local area network (LAN) and the Internet.

The control unit 12 assigns each node to an identifier (ID) of an identifier space in which a plurality of identifiers are laid out, and then assigns one or more keys to each node based on the node assignment in the identifier space, to thereby enable a node responsible for a given key to be identified by its identifier. Note that a single node may be assigned to each of the identifiers in the identifier space. In addition, a set of nodes assigned to a single identifier space forms one system.

FIG. 1 illustrates three identifier spaces 21, 22, and 23. The identifier space 21 is viewed as a ring with eight black dots, for example. The number near each black dot is the identifier corresponding to the location of the black dot. The circle surrounding a black dot represents a node assigned to the identifier corresponding to the black dot. In the example of FIG. 1, the node N01 is assigned to an identifier of “0” in the identifier space 21.

The control unit 12 manages nodes using the identifier spaces 21, 22, and 23 having identical identifier arrangement. That is, the control unit 12 manages a plurality of systems corresponding to the identifier spaces 21, 22, and 23. As illustrated in FIG. 1, each of the identifier spaces 22 and 23 is viewed as a ring with eight black dots, and the identifier corresponding to the same location in the identifier space 21 is set for the location of each black dot.

Note that FIG. 1 illustrates an example of using three identifier spaces; however, the number of identifier spaces used may be two, or four or more. In addition, each of the identifier spaces of the example of FIG. 1 is represented as an identifier space of Chord, which is a DHT, for the purpose of illustration; however, the identifier space representation may be modified according to the type of an algorithm used. That is, a modification of the identifier space representation is allowed to the extent that the technique of the first embodiment for implementing multiple identifier spaces is applicable.

The storing unit 11 stores therein information on a node pool 30 that houses nodes to be assigned to identifiers occupying across the systems individually corresponding to each of the identifier spaces 21, 22, and 23. Upon receiving a request to enter a system from a node, the control unit 12 temporarily houses the node in the node pool 30. In addition, if the number of nodes being housed in the node pool 30 is equal to or larger than the number of systems, the control unit 12 selects, from the node pool 30, as many nodes as the number of systems. Then, the control unit 12 assigns the selected nodes to the same identifier in the individual systems.

That is, the control unit 12 keeps nodes requesting entry waiting for assignment, and then assigns, if the number of nodes waiting is equal to or larger than the number of identifier spaces, each node to the same identifier in a different one of the identifier spaces. In the example of FIG. 1, there are three identifier spaces 21, 22, and 23. Therefore, when the number of nodes housed in the node pool 30 has reached 3 or more, the control unit 12 selects three nodes therefrom and assigns each of them to a different one of the identifier spaces 21, 22, and 23. For example, the control unit 12 assigns the three nodes to an identifier of “6” in the individual identifier spaces 21, 22, and 23.

Assigning nodes to the same identifier in the individual identifier spaces after the number of nodes requesting to enter has reached or exceeded the number of identifier spaces allows the systems to maintain the identical node assignment. Because the key assignment in each system is determined by its node assignment, the same key or keys are assigned to nodes with the same identifier across the systems with the identical node assignment. For example, in the case of adopting the Chord algorithm, keys K1 and K7 (key identifiers of K1 and K7 are “1” and “7”, respectively) are assigned to nodes N01, N02, and N03 assigned to the identifier “0” in the identifier spaces 21, 22, and 23, respectively. Once nodes are assigned to the identifier “6”, the key K1 is assigned to these nodes while the key K7 is assigned to the nodes N01, N02, and N03 with the identifier “0”.

As described above, the information management device 10 manages systems each of which stores key-data pairs, each including a key obtained by application of a predetermined function and data associated with the key, in such a way as to be distributed among a plurality of nodes. The storing unit 11 stores therein a management table 11 a that holds information on an identifier common to the systems, one or more keys assigned to the common identifier, and nodes assigned to the common identifier. When the number of nodes housed in the node pool 30, which is a set of nodes each unassigned to any of the systems, is equal to or larger than the number of systems, the control unit 12 extracts, from the node pool 30, as many nodes as the number of systems. The control unit 12 then assigns, in association with an identifier common to the systems, each of the extracted nodes to a different one of the systems, and assigns one or more keys to the common identifier. Subsequently, the control unit 12 updates the management table 11 a according to the node assignment and the key assignment.

The application of the technique according to the first embodiment enables the establishment of a plurality of systems with an identical node assignment, in which nodes assigned to the same identifier are assigned the same key or keys. In addition, because the sequence of the identifiers set in the identifier space of each system is the same, a transaction on information associated with a designated key is reflected in a corresponding node of each system based on an identifier. Therefore, it is easy to implement synchronization of the relationships among keys, information, and nodes across the systems.

This results in practically creating the same condition as if there are replicated systems. Thus, even if one or more nodes exit their systems, nodes on other systems hold information, and it is therefore possible to prevent loss of the information due to the node exits. In addition, the application of the technique according to the first embodiment eliminates the need for a plurality of nodes assigned within the same identifier space to hold the same information for the purpose of backup. As a result, it is possible to avoid the burden involved in transferring information for backup between nodes when a node enters or exits. As a consequence, even if there are nodes frequently repeating entries and exits, an increase in the communication and processing load caused when the nodes enter and exit is reduced. The first embodiment has been described thus far.

(b) Second Embodiment

A second embodiment is directed to a technique for preventing the loss of information due to a node exit in a system implementing an autonomous distributed KVS using, for example, a DHT. The second embodiment further relates to a mechanism for reducing inter-node communication load and processing load of nodes at the time of each node exit even if there are nodes likely to frequently repeat system entries and exits.

b-1. Example of Autonomous Distributed KVS System

The autonomous distributed KVS system employs a technique, such as a DHT, that allows locating a node storing a value corresponding to a designated key. Next described are Chord, which is a DHT-based implementation, and other techniques applicable to the autonomous distributed KVS system. Note that the Chord algorithm is presented here as a major example for the purpose of illustration; however, the application of the technique according to the second embodiment is not limited to this.

[Chord]

Next described is the Chord algorithm (hereinafter simply referred to as “Chord”) applicable to implementation of the autonomous distributed KVS system with reference to FIGS. 2 to 4. FIG. 2 is a first diagram illustrating an example of an autonomous distributed KVS system (Chord). FIG. 3 is a second diagram illustrating the example of the autonomous distributed KVS system (Chord). FIG. 4 is a third diagram illustrating the example of the autonomous distributed KVS system (Chord).

Chord implements a mechanism of uniquely locating a node to which a given key has been assigned by allocating identifiers across an identifier space having a ring structure and determining the assignment of each node to an identifier and the assignment of a key to each node based on defined rules. The example of FIG. 2 illustrates a scheme for assigning three nodes (Node #0, Node #1, and Node #3) across an identifier space with m-bit (m=3) identifiers. In addition, the example of FIG. 2 illustrates a scheme for assigning three keys (Key #1, Key #2, and Key #6) to the nodes. Node # i (i=0, 1, or 3) is assigned to a location of “ID=i” (hereinafter denoted by ID # i). Note that an identifier to which Node # i has been assigned is sometimes denoted by NodeID. In addition, the identifier of Key # j is “j”, and the identifier is sometimes denoted by KeyID.

When, in Chord, Key # j is assigned to a node in the identifier space, if a node has been assigned to ID # j (an identifier having the same value as KeyID), Key # j is assigned to the node. On the other hand, if a node is not assigned to ID # j, the first identifier to which a node is assigned (Next NodeID) is identified among identifiers found in clockwise direction along the ring after ID # j, and Key # j is assigned to the node assigned to Next NodeID. In the example of FIG. 2, because Node #1 has been assigned to ID #1, Key #1 is assigned to Node #1. In addition, because a node is not assigned to ID #2, Key #2 is assigned to Node #3 having been assigned to ID #3, which is the first identifier with a node assigned thereto found in clockwise direction after ID #2. In like fashion, because a node is not assigned to ID #6, Key #6 is assigned to Node #0 having been assigned to ID #0, which is the first identifier with a node assigned thereto found in clockwise direction after ID #6.

Node #0, Node #1, and Node #3 have routing tables used to look up Key #1, Key #2, and Key #6. Each routing table has information on ranges each including KeyID of a key for lookup (intervals); and nodes each responsible for the corresponding key (successors). For example, (A) in FIG. 2 is a routing table held in Node #0. In Chord, each routing table contains m intervals and identifiers of successors corresponding to the individual intervals. Each interval is calculated based on NodeID (n) and a row number (k) of the routing table. The starting point of an interval (Start(n, k)) is obtained by the following equation (1): Start(n,k)=(n+2^(k-1))mod 2^(m)  (1).

Then, each interval is defined as a range equal to or more than Start(n, k) and less than Start(n+1, k). For example, in the case of n=0 and k=1, Start (0, 1) is 1 and Start (1, 1) is 2. Therefore, the interval in the first row of the routing table held in Node #0 is defined as a range equal to or more than 1 and less than 2.

As for each successor (abbreviated to “Suc.” in the figures), in the case where a node is assigned to an identifier having the same numerical value as that of Start, the successor takes the same numerical value as that of Start. On the other hand, in the case where no node is assigned to an identifier having the same numerical value as that of Start, the successor takes the same numerical value as the first identifier with a node assigned thereto (Next NodeID) found in clockwise direction along the ring after the identifier having the same numerical value as that of Start. For example, in the case of n=0 and k=1, the successor is 1. Further by obtaining intervals and successors for k=2 and 3, the routing table (A) in FIG. 2 is configured. Note that (B) in FIG. 2 is a routing table held in Node #1 and (C) in FIG. 2 is a routing table held in Node #3.

For example, upon receiving a request for a transaction on a value associated with Key #2, Node #0 refers to its routing table and then identifies the interval ([2, 4)) including a KeyID of “2”. Subsequently, Node #0 notes that a successor corresponding to the identified interval (Node #3 having been assigned to ID #3) is responsible for Key #2, and requests Node #3 to execute the requested transaction.

As described above, Chord has a mechanism of allowing the assignment of each key to be determined based on the assignment of nodes to the identifiers so that each node is able to locate a node responsible for a given key. Each node has a routing table including intervals preliminarily calculated based on the node assignment as well as successors. The routing table is used to search for a node responsible for a given key, and the node found by the search then executes a requested transaction on the value associated with the key.

In the case where a new node is added to the identifier space (a node entry), the routing tables of at least some of the nodes in the identifier space are updated. In addition, because there is a change in the node assignment, the assignment of keys may also be updated. For example, as illustrated in FIG. 3, when Node #6 newly enters, Key #6 is assigned to Node #6. Then, within the routing table held in Node #0, the successor in the third row is changed to “6” (see (A) in FIG. 3). Within the routing table held in Node #1, the successor in the third row is changed to “6” ((B) in FIG. 3). Within the routing table held in Node #3, the successors in the first and second rows are changed to “6” ((C) in FIG. 3).

Procedures for calculating the routing table of Node #6 ((D) in FIG. 3) and the routing tables of Node #0, Node #1, and Node #3 are the same as those for calculating the routing tables illustrated in FIG. 2. Thus, in response to a node entry, key reassignment and routing table updates are performed. In addition, when a node exits the identifier space (a node exit), key reassignment and routing table updates are performed as represented in FIG. 4 (which illustrates an example where Node #1 exits).

[Other Techniques]

Other than Chord above, DHT's called Content Addressable Network (CAN), Pastry, and Kademlia are also employed as mechanisms for efficiently locating a node responsible for a given key. CAN employs an n-dimensional torus as a logical space (corresponding to an identifier space in Chord) to which keys are mapped. Pastry employs the Pastry algorithm as a logical space. Kademlia employs a binary tree as a logical space. In addition, other than various DHT's, Skip Graph may be used instead to implement an autonomous distributed KVS system. The technique according to the second embodiment is widely applicable to autonomous distributed KVS systems employing these various mechanisms.

b-2. Multiple Distributed KVS System

Next described is a multiple distributed KVS system according to the second embodiment with reference to FIGS. 5 to 7. FIG. 5 illustrates an example of the multiple distributed KVS system according to the second embodiment. FIG. 6 illustrates node management taking place in the multiple distributed KVS system according to the second embodiment. FIG. 7 illustrates an example of a routing table held in each node according to the second embodiment.

As illustrated in FIG. 5, the multiple distributed KVS system of the second embodiment includes, for example, a control device 100, gateway (GW) devices 200-1, 200-2, . . . , 200-N, and terminals 301, 302, and 303. The control device 100 is a computer such as a personal computer and a server. The gateway devices 200-1, 200-2, . . . , 200-N and the terminals 301, 302, and 303 are mobile terminals, such as personal computers, mobile phones, smartphones, car navigation systems, and tablet terminals. The control device 100 and the gateway devices 200-1, 200-2, . . . , 200-N are able to communicate with each other via a network 300. The gateway device 200-1 is able to communicate with the terminals 301, 302, and 303 using short-range communication such as Bluetooth (registered trademark) or BT.

Each of the control device 100, the gateway devices 200-1, 200-2, . . . , 200-N, and the terminals 301, 302, and 303 is identified by identification information, such as a Uniform Resource Identifier (URI) and an Internet Protocol (IP) address. At least some of the gateway devices 200-1, 200-2, . . . , 200-N, and the terminals 301, 302, and 303 have functions of, for example, a Global Positioning System (GPS), a temperature sensor, or an acceleration sensor, and are able to hold information acquired using such functions (sensed information).

For example, each of the terminals 301, 302, and 303 individually transmits the type and characteristics of its sensed information and its own identification information piece to the gateway device 200-1 using short-range communication. The gateway device 200-1 holds the identification information piece of each of the terminals 301, 302, and 303 in association with one or more keys. In addition, each of the gateway devices 200-2, . . . , 200-N individually acquires and holds sensed information, and holds its own identification information piece in association with one or more keys. In this case, the gateway devices 200-1, 200-2, . . . , 200-N individually function as nodes of an autonomous distributed KVS system, and the identification information pieces each indicating a storage location of sensed information are values to be associated with keys.

The control device 100 is configured to set one or more nodes for managing node entries and exits to and from the autonomous distributed KVS system (initial nodes) and notify other nodes of information on the initial nodes. For example, the control device 100 has a function of a Web server, and notifies the other nodes of the information on the initial nodes using the function. Note that FIG. 5 merely illustrates an example of a system to which the technique of the second embodiment is applicable, and the scope of the application is not limited to this case. Note however that, in the following description, the gateway devices 200-1, 200-2, . . . , 200-N are referred to as nodes for the purpose of illustration.

[Node Types and Assignment, Key Assignment, and Routing Tables]

There are two types of nodes, initial and normal nodes. Each initial node has a function of managing node entries and exits (a management function). Each normal node lacks the management function of the initial node. Initial nodes are preliminarily designated by the control device 100. In addition, the control device 100 notifies individual nodes of information on identifiers to each of which an initial node is assigned. Nodes other than initial nodes are all normal nodes.

The example of FIG. 6 illustrates node assignment in the multiple distributed KVS system according to the second embodiment. As illustrated in FIG. 6, the multiple distributed KVS system uses a plurality of identifier spaces 401, 402, and 403. The identifier spaces 401, 402, and 403 individually have the same m-bit identifier sequence (m=3; and ID=0, 1, . . . , 7). In addition, control is exercised in such a manner that the identifier spaces 401, 402, and 403 share a common node assignment. For example, an initial node 210 is assigned to ID #0 of the identifier space 401. In this case, nodes (normal nodes 220 and 230 in the example of FIG. 6) are individually assigned to ID #0 of the identifier spaces 402 and 403. The identical ID sequence is laid out in each of the identifier spaces 401, 402, and 403, and the identical node assignment is made for the identifier spaces 401, 402, and 403. Therefore, the same key-value pairs are stored in nodes assigned to the same identifier.

In the example of FIG. 6, in the identifier space 401, the initial node 210 is assigned to ID #0; an initial node 212 is assigned to ID #2; and a normal node 214 is assigned to ID #4. In the identifier space 402, the normal node 220 is assigned to ID #0; a normal node 222 is assigned to ID #2; and a normal node 224 is assigned to ID #4. In the identifier space 403, the normal node 230 is assigned to ID #0; a normal node 232 is assigned to ID #2; and a normal node 234 is assigned to ID #4. For example, when Key #0, Key #1, . . . , Key #7 are prepared as keys to be assigned to nodes, the nodes individually assigned to ID #0 are made responsible for Key #5, Key #6, Key #7, and Key #0. The nodes individually assigned to ID #2 are made responsible for Key #1 and Key #2. The nodes individually assigned to ID #4 are made responsible for Key #3 and Key #4. Then, a value is associated with each of these keys, and, using such a key, a transaction is performed on the associated value. Note that rules of Chord (see (D) in FIG. 2) are employed here as an example of how to assign keys.

Thus, the multiple distributed KVS system of the second embodiment adopts a mechanism of redundantly storing key-value pairs of each node by managing a plurality of identifier spaces with the identical ID sequence laid out therein and assigning multiple nodes to the same identifier. In order to implement this mechanism, the initial nodes 210 and 212 manage node pools 410 and 412, respectively, as illustrated in FIG. 6. The node pools 410 and 412 are used to temporarily house nodes requesting entry into the system and keep them waiting for assignment to identifiers.

Note that the initial nodes 210 and 212 exchange information to share the same content between the node pools 410 and 412. In the example of FIG. 6, the initial nodes 210 and 212 manage the node pools 410 and 412, respectively; however, this may be modified in such a manner that either one or both of the initial nodes 210 and 212 manage a single, common node pool provided for them. For example, when the initial node 210 receives an entry request from a node, the initial node 210 temporarily houses the entry-requesting node in the node pool 410. Then, the initial node 210 determines whether the number of nodes housed in the node pool 410 is larger than the number of identifier spaces (3 in the example of FIG. 6). If the number of nodes being housed is larger than the number of identifier spaces, the initial node 210 selects, from the node pool 410, nodes as many as the number of identifier spaces and, then, allocates the same identifier to each of the selected nodes. Subsequently, the initial node 210 assigns each of the ID-allocated nodes to the corresponding identifier in one of the identifier spaces 401, 402, and 403. This method enables the identical node assignment across the identifier spaces 401, 402, and 403 to be maintained even after the new node entry.

Each node of the multiple distributed KVS system according to the second embodiment has occasion to access a node in an identifier space different from one to which the node belongs. Therefore, each node has a routing table including information on nodes belonging to different identifier spaces. For example, the nodes assigned to ID #0 (i.e., the initial node 210 and the normal nodes 220 and 230) individually have a routing table illustrated in FIG. 7. The routing table according to the second embodiment includes columns of the following items, as illustrated in FIG. 7: an identifier to which the nodes have been assigned (NodeID: n); row number k; start; interval; and successor.

The routing table of FIG. 7 is different from that of (A) in FIG. 2 in including, in the successor column, information on nodes belonging to different identifier spaces. In the example of FIG. 7, the successor column contains entries of identifiers for identifying successors, and entries of information (IP addresses) used to access the successors in the individual identifier spaces. For example, when n=0 and k=1, the identifier of the successors is 2. The nodes assigned to ID #2 in the identifier spaces 401, 402, and 403 are the initial node 212 and the normal nodes 222 and 232, respectively. Therefore, the successor column contains entries of IP addresses of the initial node 212 and the normal nodes 222 and 232.

FIG. 7 illustrates an example of a routing table held in the nodes assigned to ID #0; however, each node assigned to another identifier holds a routing table corresponding to the node. Therefore, when a node in an identifier space receives a transaction request, the node is able to not only locate a transaction-target node within its own identifier space, but also locate transaction-target nodes deployed in the other identifier spaces. Then, with the use of the above-described routing table, it is possible to send the transaction request to, amongst the transaction target nodes, one in a good communication state. In addition, even when one of the transaction-target nodes has exited its own identifier space, a transaction-target node in a different identifier space is instead able to perform the requested transaction. Therefore, the system operations are continued without needing extra processing steps. Further, in the case where a node having once exited re-enters, it is possible to quickly restore the node to its former state by assigning the node to an identifier to which the node was assigned before the exit and performing synchronization with other nodes assigned to the same identifier. The multiple distributed KVS system has been described thus far.

b-3. Hardware

Next described is hardware capable of implementing functions of a node according to the second embodiment with reference to FIG. 8. FIG. 8 illustrates an example of hardware capable of implementing functions of a node according to the second embodiment. For example, the functions of the initial node 210 are implemented using hardware resources illustrated in FIG. 8. That is, the functions of the initial node 210 are implemented by controlling the hardware of FIG. 8 using a computer program.

The hardware mainly includes a CPU 902, read only memory (ROM) 904, RAM 906, a host bus 908, and a bridge 910, as illustrated in FIG. 8. Further, the hardware includes an external bus 912, an interface 914, an input unit 916, an output unit 918, a storing unit 920, a drive 922, a connection port 924, and a communicating unit 926. The CPU 902 functions, for example, as an arithmetic processing unit or a control device, and exercises control over all, or a part of, operations of the individual structural elements based on various programs recorded on the ROM 904, the RAM 906, the storing unit 920, or a removable storage medium 928. The ROM 904 is an example of memory units for storing, for example, programs to be loaded into the CPU 902 and data or the like to be used for calculation. The RAM 906 temporarily or permanently stores therein, for example, programs to be loaded into the CPU 902 as well as various parameters to change in the execution of the programs. These structural elements are connected to each other, for example, via the host bus 908 capable of high-speed data transmission. On the other hand, the host bus 908 is connected, for example, through the bridge 910 to the external bus 912 with a relatively low data transmission speed.

The input unit 916 is, for example, a mouse, a keyboard, a touch panel, a touch-pad, buttons, switches, levers or the like. Further, the input unit 916 may be a remote controller capable of transmitting a control signal using infrared or other radio waves. In addition, the input unit 916 may be other than such a device through which the user inputs information, and, for example, a device for collecting information sensed by a GPS, a temperature sensor, or an acceleration sensor and inputting the collected information into the CPU 902. The output unit 918 is, for example, a display device such as a cathode ray tube (CRT), a liquid crystal display (LCD), a plasma display panel (PDP), or an electro-luminescence display (ELD). Further, an audio output device, such as a speaker or headphones, or a printer may be employed as the output unit 918. That is, the output unit 918 is a device capable of outputting information visually or audibly.

The storing unit 920 is a device for storing therein various types of data. The storing unit 920 is, for example, a magnetic storage device such as a HDD, or alternatively may be a semiconductor storage device such as a SSD and a RAM disk, an optical storage device, or a magneto-optical storage device. The drive 922 is a device for reading information recorded on the removable storage medium 928 and writing information to the removable storage medium 928. The removable storage medium 928 is, for example, a magnetic disk, an optical disk, a magneto-optical disk, or semiconductor memory.

The connection port 924 is a port for connecting an external connection device 930, and is, for example, a universal serial bus (USB) port, an Institute of Electrical and Electronics Engineers (IEEE)-1394 port, a small computer system interface (SCSI), an RS-232C port, or an optical audio terminal. The external connection device 930 is, for example, a printer. The communicating unit 926 is a communication device used to connect with a network 932. The communicating unit 926 is, for example, a wired or wireless LAN communication circuit, a wireless USB (WUSB) communication circuit, an optical communication circuit or router, an Asymmetric Digital Subscriber Line (ADSL) communication circuit or router, or a mobile network communication circuit. The network 932 connected to the communicating unit 926 is a network connected with a wire or wirelessly, and is, for example, the Internet, a LAN, a broadcasting network, or a satellite communication link.

Note that the functions of each node other than the initial node 210 may also be implemented using the hardware illustrated in FIG. 8. That is, the functions of each of the gateway devices 200-1, 200-2, . . . , 200-N may be implemented using the hardware illustrated in FIG. 8. In addition, the functions of each of the control device 100 and the terminals 301, 302, and 303 may be implemented using the hardware illustrated in FIG. 8. Further, the hardware of FIG. 8 with some components removed therefrom or added thereto may be accepted as modifications. The hardware according to the second embodiment has been described thus far.

b-4. Functions

Next described are functions of individual nodes.

[Initial Nodes]

First, functions of an initial node are described with reference to FIG. 9. FIG. 9 is a block diagram illustrating an example of functions of an initial node according to the second embodiment. Note that the functions of the initial node 210 are described as an example for the purpose of illustration. As illustrated in FIG. 9, the initial node 210 includes a storing unit 241, a transaction processing unit 242, a search processing unit 243, a pool managing unit 244, an entry processing unit 245, a synchronization processing unit 246, an alive monitoring unit 247, and an exit processing unit 248. Note that functions of the storing unit 241 may be implemented using, for example, the RAM 906 or the storing unit 920 described above. Functions of the transaction processing unit 242, the search processing unit 243, the pool managing unit 244, the entry processing unit 245, the synchronization processing unit 246, the alive monitoring unit 247, and the exit processing unit 248 may be implemented using, for example, the CPU 902 described above.

The storing unit 241 stores therein KVS data 241 a, a transaction history 241 b, a routing table 241 c, an initial node list 241 d, a same identifier node list 241 e, node pool information 241 f, and Round-Trip Time (RTT) data 241 g. The KVS data 241 a is key-value pairs, in each of which a key assigned to the initial node 210 (each of Key #5, Key #6, Key #7, and Key #0 in the example of FIG. 6) and a value are associated with each other.

The transaction history 241 b is a history of transactions executed by the initial node 210 or nodes assigned to the same identifier as that to which the initial node 210 is assigned, as illustrated in FIG. 10. FIG. 10 illustrates an example of the transaction history according to the second embodiment.

The transaction history 241 b of FIG. 10 includes a transaction record of storing Key #5 in association with val05 (“put Key #5 val05”) and a transaction record of storing Key #6 in association with val06 (“put Key #6 val06”). The transaction history 241 b also includes a transaction record of deleting val05 associated with Key #5 (“del Key #5 val05”) and a transaction record of storing Key #7 in association with val07 (“put Key #7 val07”). In the transaction history 241 b, each transaction record is accompanied by information on an identifier space to which a node having executed the transaction belongs. For example, in the case where the initial node 210 has executed the transaction of storing Key #5 in association with val05, information on the identifier space 401 to which the initial node 210 belongs is added to the transaction history 241 b, in association with the corresponding transaction record. Similarly, records of transactions each executed by a node assigned to the same identifier as that to which the initial node 210 is assigned are accumulated in the transaction history 241 b of the storing unit 241, and each of the accumulated transaction records is accompanied by information on an identifier space to which a node having executed the transaction belongs.

The routing table 241 c is used to locate a node responsible for a given key. For example, the routing table 241 c used by the initial node 210 is represented in FIG. 11. FIG. 11 illustrates an example of the routing table according to the second embodiment. As illustrated in FIG. 11, the routing table 241 c includes, for example, columns of the following items: row number k; start; interval; and successor. The successor column includes, for each entry, information of a successor (e.g. IP address) belonging to the same identifier space 401 as the initial node 210 as well as information of nodes (e.g. IP addresses) in the identifier spaces 402 and 403, assigned to the same identifier as that to which the successor in the identifier space 401 is assigned.

The initial node list 241 d contains information of all initial nodes (e.g. IP addresses) designated by the control device 100, as illustrated in FIG. 12. FIG. 12 illustrates an example of the initial node list according to the second embodiment. The initial nodes 210 and 212 are designated in the example of FIG. 6 and, therefore, information of the initial nodes 210 and 212 is set forth in the initial node list 241 d of FIG. 12.

The same identifier node list 241 e contains information of nodes (e.g. IP addresses) assigned to the same identifier as that to which the initial node 210 is assigned, as illustrated in FIG. 13. FIG. 13 illustrates an example of the same identifier node list according to the second embodiment. The normal nodes 220 and 230 are assigned to IN #0 to which the initial node 210 is also assigned in the example of FIG. 6 and, therefore, information of the normal nodes 220 and 230 is set forth in the same identifier node list 241 e of FIG. 13.

The node pool information 241 f includes, as illustrated in FIG. 14, information of nodes (e.g. IP addresses) housed in the node pool 410. FIG. 14 illustrates an example of the node pool information according to the second embodiment. For example, in the case where normal nodes 216 and so on are housed in the node pool 410, information of the normal nodes 216 and so on is set forth in the node pool information 241 f.

The RTT data 241 g is, as illustrated in FIG. 15, data indicating the round-trip time (RTT) measured for each node pair formed of nodes housed in the node pool 410. FIG. 15 illustrates an example of RTT data according to the second embodiment. The RTT is the length of time it takes for a message to be sent from a node of each pair to the other node plus the length of time it takes for an acknowledgement of the message to be received. The reference to each RTT allows evaluating the distance between the two nodes on a communication path therebetween.

For example, by extracting pairs of nodes on short RTT paths (which is often termed “clustering”) with reference to the RTT data 241 g, a set of nodes having short communication paths (a neighboring node group) is obtained. In a multiple distributed KVS system, transfer of transaction requests and synchronization of transaction records are made across nodes assigned to the same identifier, and the system performance is therefore enhanced more by assigning nodes with shorter inter-node distances to the same identifier. For this reason, in the multiple distributed KVS system of the second embodiment, nodes belonging to a neighboring node group are assigned to the same identifier. To do this, the RTT data 241 g is used.

Now let us refer back to FIG. 9. The transaction processing unit 242 processes a request for a transaction received from a user of the multiple distributed KVS system or a different node. For example, the user requests the initial node 210 via the control device 100 for a transaction. If the transaction is related to a key assigned to the initial node 210, the transaction processing unit 242 reflects the transaction according to the request in the KVS data 241 a. In addition, the transaction processing unit 242 adds the content of the transaction and information of its own identifier space 401 to the transaction history 241 b. If the received transaction request is issued by another node, the transaction processing unit 242 reflects the transaction in the KVS data 241 a and adds appropriate information to the transaction history 241 b, as is the case described above.

The search processing unit 243 locates a node responsible for a designated key by referring to the routing table 241 c. For example, when the transaction processing unit 242 receives a request for a transaction on a key which is not assigned to the initial node 210, the search processing unit 243 identifies the identifier of a successor corresponding to the key based on the routing table 241 c. For example, when the transaction processing unit 242 receives a request for a transaction on Key #1 (KeyID=1), the search processing unit 243 refers to the routing table 241 c (see FIG. 11) and identifies the interval ([1, 2)) including the KeyID. In addition, the search processing unit 243 identifies the identifier (ID=2) of the successor corresponding to the identified interval. Then, the search processing unit 243 notifies the transaction processing unit 242 of the identifier of the identified successor. Upon receiving the notification, the transaction processing unit 242 transfers the transaction request to the successor.

The pool managing unit 244 manages the node pool 410. For example, when a node is added to the node pool 410, the pool managing unit 244 collects information of the added node (e.g. IP address) and adds the collected information to the node pool information 241 f. In addition, the pool managing unit 244 notifies the initial node 212 of the node addition and provides the initial node 212 with information of the added node. On the other hand, when the pool managing unit 244 is notified by the initial node 212 of node addition, the pool managing unit 244 adds node information provided by the initial node 212 to the node pool information 241 f.

The pool managing unit 244 also measures the RTT between every pair of nodes housed in the node pool 410 and adds the measured RTT to the RTT data 241 g. In addition, the pool managing unit 244 extracts a neighboring node group based on the RTT's set forth in the RTT data 241 g. Note that the RTT measurement is made at predetermined intervals or timing. The neighboring node group extraction may be performed at predetermined intervals or timing, or may be performed when the entry processing unit 245 executes node entry processing.

The entry processing unit 245 performs a process associated with a node entry. For example, upon receiving an entry request from a node not assigned to an identifier, the entry processing unit 245 houses the node in the node pool 410. In addition, if determining, with reference to the node pool information 241 f, that the number of nodes housed in the node pool 410 is equal to or more than the number of identifier spaces, the entry processing unit 245 selects nodes as many as the number of identifier spaces and allocates the same identifier to each of the selected nodes. Subsequently, the entry processing unit 245 assigns each of the ID-allocated nodes to the corresponding identifier in one of the identifier spaces 401, 402, and 403.

Note that the entry processing unit 245 may be configured to perform the selection of nodes, the allocation of an identifier, and the node assignment to the identifier if there is a neighboring node group including nodes as many as the number of identifier spaces. In this case, node entries are held off even if nodes as many as or more than the number of identifier spaces are housed in the node pool 410. This scheme contributes to improving the system performance because a set of nodes having short communication paths is assigned to the same identifier.

The synchronization processing unit 246 synchronizes the transaction history 241 b with other nodes assigned to the same identifier. For example, the synchronization processing unit 246 determines, among transaction records in the transaction history 241 b, those yet to be passed to other nodes assigned to the same identifier and then notifies each of the nodes in the same identifier node list 241 e of the determined transaction records. Note that the synchronization processing may be performed at predetermined intervals or timing, or each time the transaction processing unit 242 performs a requested transaction.

The alive monitoring unit 247 monitors an acknowledgement of a transaction notification when the synchronization processing unit 246 performs synchronization processing, and determines whether a node to which the transaction notification has been sent is in a state capable of communicating according to the presence or absence of the acknowledgement. For example, the alive monitoring unit 247 measures the delay time from the transmission of the notification to the reception of the acknowledgement. If the delay time exceeds a predetermined threshold, the alive monitoring unit 247 determines that the destination node is in a state incapable of establishing communication (that is, the destination node has been off from the system).

In addition, the alive monitoring unit 247 counts the number of nodes determined to have exited the system. Then, if the counted number is equal to or more than a predetermined threshold (for example, 2), the alive monitoring unit 247 notifies the exit processing unit 248 of the number of nodes having exited being equal to or more than the threshold. Note that the alive monitoring unit 247 may count the number of remaining nodes other than the initial node 210 and then compare the counted number with a predetermined threshold (for example, 1). Then, the alive monitoring unit 247 deletes information of the nodes determined to have exited from the same identifier node list 241 e and the routing table 241 c.

The exit processing unit 248 performs a process of pulling out of the system the initial node 210 as well as other nodes assigned to the same identifier as that to which the initial node 210 is assigned. For example, upon receiving, from the alive monitoring unit 247, a notification indicating that the number of nodes having exited is equal to or more than the threshold, the exit processing unit 248 selects, amongst nodes assigned to identifiers different from that to which the initial node 210 is assigned, an alternative node to which the KVS data 241 a is going to be transferred. Then, the exit processing unit 248 transfers the KVS data 241 a to the alternative node and notifies each node not targeted for the exit processing of the exit of the initial node 210.

In addition, the exit processing unit 248 issues an entry request to the initial node 212. By issuing the entry request to the initial node 212, the initial node 210 is housed in the node pool 412. Note that if there is a different node subject to the exit processing, the exit processing unit 248 may instruct the different node to determine an alternative node, transfer KVS data, send a notification of its exit, and issue an entry request.

Further, the exit processing unit 248 requests the control device 100 to designate an initial node in place of the initial node 210. Note that if there is no initial node other than the initial node 210, the exit processing unit 248 requests the control device 100 to designate an initial node before notifying each node not targeted for the exit processing of the exit of the initial node 210. Then, after a new initial node is established and each node is notified of the new initial node, the exit processing unit 248 sends the notification of the exit of the initial node 210 and issues an entry request to the new initial node. The functions of the initial node 210 have been described thus far. Note that the initial node 212 has the same functions as those of the initial node 210.

[Normal Nodes]

Next, functions of a normal node are described with reference to FIG. 16. FIG. 16 is a block diagram illustrating an example of functions of a normal node according to the second embodiment. Note that the functions of the normal node 230 are described as an example for the purpose of illustration. As illustrated in FIG. 16, the normal node 230 includes a storing unit 251, a transaction processing unit 252, a search processing unit 253, an entry processing unit 254, a synchronization processing unit 255, an alive monitoring unit 256, and an exit processing unit 257. Note that functions of the storing unit 251 may be implemented using, for example, the RAM 906 or the storing unit 920 described above. Functions of the transaction processing unit 252, the search processing unit 253, the entry processing unit 254, the synchronization processing unit 255, the alive monitoring unit 256, and the exit processing unit 257 may be implemented using, for example, the CPU 902 described above.

The storing unit 251 stores therein KVS data 251 a, a transaction history 251 b, a routing table 251 c, an initial node list 251 d, and a same identifier node list 251 e. The KVS data 251 a is key-value pairs, in each of which a key assigned to the normal node 230 (each of Key #5, Key #6, Key #7, and Key #0 in the example of FIG. 6) and a value are associated with each other. The transaction history 251 b is a history of transactions executed by the normal node 230 or nodes assigned to the same identifier as that to which the normal node 230 is assigned, as in the case of the transaction history 241 b above (see FIG. 10). The routing table 251 c is used to locate a node responsible for a given key, as in the case of the routing table 241 c above (see FIG. 11).

The initial node list 251 d contains information of all initial nodes (e.g. IP addresses) designated by the control device 100, as in the case of the initial node list 241 d above (see FIG. 12). The same identifier node list 251 e contains information of nodes (e.g. IP addresses) assigned to the same identifier as that to which the normal node 230 is assigned, as in the case of the same identifier node list 241 e (see FIG. 13).

Note that because the normal node 230 and the initial node 210 are assigned to the same identifier, the content of the routing table 251 c and the same identifier node list 251 e is almost the same as that of the routing table 241 c and the same identifier node list 241 e, respectively. In addition, each node has the same content of the initial node list 251 d.

The transaction processing unit 252 processes a request for a transaction received from a user of the multiple distributed KVS system or a different node. For example, the user requests the normal node 230 via the control device 100 for a transaction. If the transaction is related to a key assigned to normal node 230, the transaction processing unit 252 reflects the transaction according to the request in the KVS data 251 a. In addition, the transaction processing unit 252 adds the content of the transaction and information of its own identifier space 403 to the transaction history 251 b. If the received transaction request is issued by another node, the transaction processing unit 252 reflects the transaction in the KVS data 251 a and adds appropriate information to the transaction history 251 b, as is the case described above.

The search processing unit 253 locates a node responsible for a designated key by referring to the routing table 251 c. For example, when the transaction processing unit 252 receives a request for a transaction on a key which is not assigned to the normal node 230, the search processing unit 253 identifies the identifier of a successor corresponding to the key based on the routing table 251 c. Then, the search processing unit 253 notifies the transaction processing unit 252 of the identifier of the identified successor. Upon receiving the notification, the transaction processing unit 252 transfers the transaction request to the successor.

The entry processing unit 254 issues an entry request to an initial node set forth in the initial node list 251 d. When an identifier is allocated by the initial node and the normal node 230 is assigned to the identifier, the entry processing unit 254 acquires information on node assignment from the initial node and generates the routing table 251 c. In the case where the initial node generates the routing table 251 c, the entry processing unit 254 acquires the routing table 251 c from the initial node.

The synchronization processing unit 255 synchronizes the transaction history 251 b with other nodes assigned to the same identifier. For example, the synchronization processing unit 255 determines, among transaction records in the transaction history 251 b, those yet to be passed to other nodes assigned to the same identifier and then notifies each of the nodes in the same identifier node list 251 e of the determined transaction records.

Note that the synchronization processing may be performed at predetermined intervals or timing, or each time the transaction processing unit 252 performs a requested transaction. In addition, the synchronization processing unit 255 may request each of the nodes assigned to the same identifier for synchronization when the normal node 230 enters the system, then store transaction histories acquired from the nodes in the storing unit 251 as the transaction history 251 b, and generate the KVS data 251 a based on the transaction history 251 b.

The alive monitoring unit 256 monitors an acknowledgement of a transaction notification when the synchronization processing unit 255 performs synchronization processing, and determines whether a node to which the transaction notification has been sent is in a state capable of communicating according to the presence or absence of the acknowledgement. For example, the alive monitoring unit 256 measures the delay time from the transmission of the notification to the reception of the acknowledgement. If the delay time exceeds a predetermined threshold, the alive monitoring unit 256 determines that the destination node is in a state incapable of establishing communication (that is, the destination node has been off from the system).

In addition, the alive monitoring unit 256 counts the number of nodes determined to have exited the system. Then, if the counted number is equal to or more than a predetermined threshold (for example, 2), the alive monitoring unit 256 notifies the exit processing unit 257 of the number of nodes having exited being equal to or more than the threshold. Note that the alive monitoring unit 256 may count the number of remaining nodes other than the normal node 230 and then compare the counted number with a predetermined threshold (for example, 1). Then, the alive monitoring unit 256 deletes information of the nodes determined to have exited from the same identifier node list 251 e and the routing table 251 c.

The exit processing unit 257 performs a process of pulling out of the system the normal node 230 as well as other nodes assigned to the same identifier as that to which the normal node 230 is assigned. For example, upon receiving, from the alive monitoring unit 256, a notification indicating that the number of nodes having exited is equal to or more than the threshold, the exit processing unit 257 selects, amongst nodes assigned to identifiers different from that to which the normal node 230 is assigned, an alternative node to which the KVS data 251 a is going to be transferred. Then, the exit processing unit 257 transfers the KVS data 251 a to the alternative node and notifies each node not targeted for the exit processing of the exit of the normal node 230.

In addition, the exit processing unit 257 issues an entry request to the initial node 212. By issuing the entry request to the initial node 212, the normal node 230 is housed in the node pool 412. Note that if there is a different node subject to the exit processing, the exit processing unit 257 may instruct the different node to determine an alternative node, transfer KVS data, send a notification of its exit, and issue an entry request. The functions of the normal node 230 have been described thus far. Note that other normal nodes than the normal node 230 (e.g. the normal node 214) individually have the same functions as those of the normal node 230.

b-5. Processing Sequences

Next described are processing sequences taking place in the multiple distributed KVS system.

[Node Entry]

First, a processing sequence taking place at the time of a node entry is described with reference to FIGS. 17 and 18. FIG. 17 illustrates a node assignment method according to the second embodiment. FIG. 18 is a flow diagram illustrating the processing sequence taking place at the time of the node entry according to the second embodiment. An example of FIG. 17 illustrates assignment processing performed in response to an entry request issued by a normal node 216 to the initial node 210. According to this example, normal nodes 226, 227, 233, and 236 are housed in the node pool 410, and the initial node 210 then houses the normal node 216 in the node pool 410 upon receiving the entry request from the normal node 216.

For example, when the normal nodes 216, 226, and 236 are extracted as a neighboring node group based on the RTT data 241 g, the initial node 210 allocates the same identifier (ID #6 in this example) to the normal nodes 216, 226, and 236. Then, the initial node 210 assigns, for example, the normal node 216 to ID #6 in the identifier space 401; the normal node 226 to ID #6 in the identifier space 402; and the normal node 236 to ID #6 in the identifier space 403.

Because changes are made to the node assignment due to the entries of the normal nodes 216, 226, and 236, the routing table held in each node is updated. If Key #0, Key #1, . . . , Key #7 have been assigned to nodes as in the example of FIG. 6, changes are also made to the key assignment due to the entries of the normal nodes 216, 226, and 236. In this example, Key #5 and Key #6 having been assigned to the initial node 210 and the normal nodes 220 and 230 are assigned to the normal nodes 216, 226, and 236.

Upon receiving an entry request such as the one above, the initial node 210 performs processing in the following sequence (see FIG. 18).

[Step S101] The entry processing unit 245 receives the entry request from the normal node 216.

[Step S102] The entry processing unit 245 acquires node information (i.e., IP address) from the normal node 216 having issued the entry request. In addition, the entry processing unit 245 adds the normal node 216 to the node pool 410. That is, the entry processing unit 245 adds the information of the normal node 216 to the node pool information 241 f.

[Step S103] The entry processing unit 245 refers to the node pool information 241 f to determine whether the number of nodes housed in the node pool 410 is equal to or more than a threshold ThJ. The threshold ThJ takes, for example, a value greater than the number of identifier spaces (multiplicity). If the number of nodes is equal to or more than the threshold ThJ, the entry processing unit 245 moves to step S104. On the other hand, if the number of nodes is below the threshold ThJ, the entry processing unit 245 moves to step S108.

[Step S104] The entry processing unit 245 refers to the RTT data 241 g and selects N nodes (N represents the multiplicity of identifier spaces) with short RTT's. Note that if neighboring node groups have been extracted, the entry processing unit 245 makes the node selection amongst a neighboring node group including N nodes therein. For example, the entry processing unit 245 makes the node selection in such a manner as to yield the minimum sum of RTT's measured for every possible pair of nodes selected from the N nodes.

[Step S105] The entry processing unit 245 allocates the same identifier to the nodes selected in step S104. In this regard, the entry processing unit 245 specifies one identifier from identifiers to which no nodes are assigned in the identifier spaces 401, 402, and 403, and allocates the specified identifier to the nodes selected in step S104. If there are a plurality of identifiers yet to be allocated, the entry processing unit 245 selects, for example, one identifier randomly from them.

[Step S106] The entry processing unit 245 instructs each of the N nodes with the same identifier allocated thereto to enter a different one of the identifier spaces 401, 402, and 403. That is, the entry processing unit 245 assigns one node to the same identifier of each of the identifier spaces 401, 402, and 403.

[Step S107] The entry processing unit 245 notifies the N nodes with the same identifier allocated thereto of information of the individual nodes (IP addresses). That is, the entry processing unit 245 collects the information from each of the N nodes and notifies them of the collected information so that they are individually able to generate the same identifier node list. After the completion of step S107, a sequence of processing illustrated in FIG. 18 ends.

[Step S108] The entry processing unit 245 notifies the normal node 216 having issued the entry request that the normal node 216 is currently pooled. The term “being pooled” refers to the state of being housed in the node pool 410 and waiting for assignment to an identifier. After receiving the notification, the normal node 216 waits for an identifier to be assigned thereto by the initial node 210. After the completion of step S108, a sequence of processing illustrated in FIG. 18 ends. The processing sequence taking place at the time of a node entry has been described thus far.

[KVS Transactions]

Next described is a processing sequence taking place at the time of receiving a KVS transaction (a transaction on KVS data) request, with reference to FIG. 19. FIG. 19 is a flow diagram illustrating the processing sequence taking place in association with receiving a KVS transaction request according to the second embodiment. In the following example, let us assume that the initial node 210 receives a transaction request for the purpose of illustration.

[Step S111] The transaction processing unit 242 receives a request for a KVS transaction (a transaction on KVS data). The KVS transaction request includes information of a key associated with a value targeted for the transaction. KVS transactions include, for example, storing a value (put), acquiring a value (get), and deleting a value (del).

[Step S112] The transaction processing unit 242 determines whether the received KVS transaction request is addressed to its own node (i.e., the initial node 210). For example, if a set of keys assigned to the initial node 210 includes the key designated by the KVS transaction request, the transaction processing unit 242 determines that the request is addressed to its own node. If having determined that the request is addressed to its own node, the transaction processing unit 242 moves to step S113. On the other hand, if having determined that the request is not addressed to its own node, the transaction processing unit 242 moves to step S114.

[Step S113] The transaction processing unit 242 executes a transaction according to the KVS transaction request. For example, if the request asks to store a value (put), the transaction processing unit 242 stores a pair of the key and its value in the storing unit 241 as the KVS data 241 a according to the request. If the request asks to acquire a value (get), the transaction processing unit 242 acquires a value associated with the designated key from the storing unit 241 and returns the acquired value to a requestor of the KVS transaction. If the request asks to delete a value (del), the transaction processing unit 242 deletes the designated key and its value from the storing unit 241. In addition, the transaction processing unit 242 records, in the transaction history 241 b, the content of the executed KVS transaction and information of the identifier space 401 to which the initial node 210 belongs. After the completion of step S113, a sequence of processing illustrated in FIG. 19 ends.

[Step S114] The transaction processing unit 242 transfers the KVS transaction request to a destination node (a node responsible for the designated key). For example, the transaction processing unit 242 notifies the search processing unit 243 of information of the key included in the request and requests for IP addresses of nodes responsible for the key. Upon receiving the request, the search processing unit 243 refers to the routing table 241 c to identify nodes responsible for the notified key (successors). Then, the search processing unit 243 notifies the transaction processing unit 242 of the IP addresses of the identified nodes.

The transaction processing unit 242 acquires, from the search processing unit 243, the IP addresses of the nodes assigned to the same identifier as IP addresses of search target nodes. The transaction processing unit 242 selects, amongst the acquired IP addresses, the IP address of a node belonging to the same identifier space 401 as the initial node 210 and then transfers the KVS transaction request to the selected IP address.

[Step S115] The transaction processing unit 242 measures the time after transferring the KVS transaction request until it receives an acknowledgement from the destination node (acknowledgement wait time). Subsequently, the transaction processing unit 242 determines whether the acknowledgement wait time is equal to or more than a threshold ThR. The threshold ThR may be set discretionally; however, for example, it is set based on a predicted value obtained by adding a margin to the RTT between the initial node 210 and the destination node. If the acknowledgement wait time is equal to or more than the threshold ThR, the transaction processing unit 242 moves to step S117. On the other hand, if the acknowledgement wait time is below the threshold ThR, the transaction processing unit 242 moves to step S116.

[Step S116] The transaction processing unit 242 receives an acknowledgement from the transfer destination (destination node) of the KVS transaction. In the case where the KVS transaction is to store a value (put) or delete a value (del), the received acknowledgment indicates the completion of the transaction at the destination node. In the case where the KVS transaction is to acquire a value (get), the transaction processing unit 242 receives a value associated with the designated key as the acknowledgement from the destination node. In this case, the transaction processing unit 242 returns the received value to the requestor of the KVS transaction. After the completion of step S116, a sequence of processing illustrated in FIG. 19 ends.

[Step S117] The transaction processing unit 242 determines whether there is a node assigned to the same identifier (destination node) as that to which the transfer destination of step S114 is assigned. For example, the transaction processing unit 242 identifies, amongst the IP addresses acquired from the search processing unit 243, IP addresses of nodes belonging to the identifier spaces 402 and 403 other than that of the initial node 210. Then, the transaction processing unit 242 transmits, to each of the identified IP addresses, a message to check the operational state of the corresponding node.

If at least one acknowledgement is obtained for the transmitted message, the transaction processing unit 242 determines that there is a destination node. If determining that there is a destination node, the transaction processing unit 242 moves to step S118. Note that in the case of having received acknowledgments from a plurality of nodes, the transaction processing unit 242 selects one from unselected nodes as a destination node. On the other hand, in the case of having determined that there is no destination node, the transaction processing unit 242 moves to step S119.

[Step S118] The transaction processing unit 242 transfers the KVS transaction request to the destination node (the node assigned to the same identifier). After the completion of step S118, the transaction processing unit 242 moves to step S115.

[Step S119] The transaction processing unit 242 performs a process to handle errors (error handling) when the KVS transaction has been terminated with an error. For example, the transaction processing unit 242 notifies the requestor of the KVS transaction of the KVS transaction having been terminated with an error. After the completion of step S119, a sequence of processing illustrated in FIG. 19 ends. The processing sequence taking place at the time of receiving a KVS transaction (a transaction on KVS data) request has been described thus far.

[Synchronization of Transaction Records and Node Alive Monitoring]

Next described is a sequence of synchronization and alive monitoring processing with reference to FIGS. 20 to 22. FIG. 20 illustrates the synchronization and alive monitoring processing according to the second embodiment. FIG. 21 is a first sequence diagram illustrating the synchronization and alive monitoring processing sequence according to the second embodiment. FIG. 22 is a second sequence diagram illustrating the synchronization and alive monitoring processing sequence according to the second embodiment.

The example of FIG. 20 depicts synchronization of transaction records and KVS data among the normal nodes 214, 224, and 234 assigned to the same identifier. Note that the synchronization processing may be performed at predetermined intervals or timing, or may be performed when a KVS transaction is completed at a node and then the transaction history of the node is updated.

According to the example of FIG. 20, records of the following transactions have already been synchronized: a transaction of storing val03 in association with Key #3 (put) by the normal node 234; and a transaction of storing val04 in association with Key #4 (put) by the normal node 224. Then, in this condition, if the normal node 214 executes a transaction of deleting val03 associated with Key #3 (del), the transaction is listed as a not-yet-synchronized transaction record, as illustrated in FIG. 20.

In this case, the normal node 214 notifies the normal nodes 224 and 234 of the not-yet-synchronized transaction record when performing synchronization to thereby request for synchronization of the transaction record. Upon receiving the request, each of the normal nodes 224 and 234 adds the sent not-yet-synchronized transaction record to its own transaction history. In addition, based on the added transaction record, the normal nodes 224 and 234 individually update their KVS data. In this example, val03 associated with Key #3 is deleted.

As described above, in synchronization, all the nodes assigned to the same identifier have communication with one another. Therefore, it is possible to detect a node in a state incapable of establishing communication in performing synchronization. For example, the normal node 214 transmits, to each of the normal nodes 224 and 234, a message to check its operational state, and checks whether an acknowledgement of the message is received (alive monitoring). Then, the normal node 214 performs synchronization with nodes having sent the acknowledgements back.

Procedures performed by the normal nodes 214, 224, and 234 assigned to the same identifier when the normal node 214 has not-yet-notified transaction records take place, for example, in the following sequence (see FIG. 21).

[Steps S121 and S122] The normal node 214 transmits the not-yet-notified transaction records to the normal nodes 224 and 234. In this regard, the normal node 214 refers to the same identifier node list and transmits the not-yet-notified transaction records to IP addresses of the normal nodes 224 and 234 assigned to the same identifier as that to which the normal node 214 is assigned.

[Steps S123 and S124] Upon receiving the not-yet-notified transaction records from the normal node 214, the normal nodes 224 and 234 individually return an acknowledgement indicating the completion of the reception to the normal node 214.

[Step S125] The normal node 214 receives the acknowledgements from the normal nodes 224 and 234, and then counts the number of nodes in a state incapable of communication (“the number of communication-incapable nodes”) according to whether an acknowledgment from each of the normal nodes 224 and 234 has been received. In this example, because the normal nodes 224 and 234 are in a state capable of communication, the number of communication-incapable nodes is 0. Then, the normal node 214 determines whether the number of communication-incapable nodes is equal to or more than a threshold ThN. The threshold ThN may be set to a number greater than or equal to 1 and, for example, set to a number obtained by subtracting 1 from the number of multiplicity of the identifier spaces (2 in this example).

In the case where the multiplicity of identifier spaces is 3, the number of communication-incapable nodes being 2 means that all the remaining nodes assigned to the same identifier as that to which the normal node 214 is assigned have exited the system (and are therefore not able to communicate normally). That is, redundancy of the KVS data has been lost. When the conditions are like this, a process described later is performed in order to restore the redundancy. In step S125 in FIG. 21, because the number of communication-incapable nodes is 0, the normal node 214 determines that the number of communication-incapable nodes is not equal to or more than the threshold ThN, and continues to engage in its operations.

[Steps S126 and S127] The normal node 224 updates its own transaction history based on the not-yet-notified transaction records received from the normal node 214 (see FIG. 20). In addition, the normal node 224 applies unexecuted KVS transactions in the updated transaction history (KVS transactions corresponding to the not-yet-notified transaction records) to its own KVS data. Then, the normal node 224 continues to engage in its operations.

[Steps S128 and S129] The normal node 234 updates its own transaction history based on the not-yet-notified transaction records received from the normal node 214 (see FIG. 20). In addition, the normal node 234 applies unexecuted KVS transactions in the updated transaction history (KVS transactions corresponding to the not-yet-notified transaction records) to its own KVS data. Then, the normal node 234 continues to engage in its operations.

After the completion of steps S125, S127, and S129, the normal nodes 214, 224, and 234, respectively, continue to engage in their operations. Now let us assume that the normal node 234 exits (step S130 to be described later) at a point in time afterward and, then, synchronization in which the normal node 214 notifies the other normal nodes 224 and 234 of not-yet-notified transaction records is performed. In this case, procedures take place in the following sequence.

[Step S130] The normal node 234 exits, for example, when the communication environment becomes worse or when the normal node 234 is turned off. The normal node 234 also exits when the user of the normal node 234 has performed an operation of exiting the multiple distributed KVS system.

[Steps S131 and S132] At the timing of performing synchronization, the normal node 214 transmits the not-yet-notified transaction records to the normal nodes 224 and 234. In this regard, the normal node 214 refers to the same identifier node list and transmits the not-yet-notified transaction records to IP addresses of the normal nodes 224 and 234 assigned to the same identifier as that to which the normal node 214 is assigned.

[Step S133] Upon receiving the not-yet-notified transaction records from the normal node 214, the normal node 224 returns an acknowledgement indicating the completion of the reception to the normal node 214. On the other hand, because the normal node 234 has already exited, the not-yet-notified transaction records transmitted from the normal node 214 to the normal node 234 do not reach the normal node 234. Therefore, the normal node 234 does not transmit an acknowledgement of the not-yet-notified transaction records.

[Step S134] The normal node 214 receives the acknowledgement from the normal node 224, and then counts the number of nodes in a state incapable of communication (“the number of communication-incapable nodes”) according to whether an acknowledgment from each of the normal nodes 224 and 234 has been received. In this example, because an acknowledgement is obtained from the normal node 224 but not obtained from the normal node 234, the number of communication-incapable nodes is 1.

Then, the normal node 214 determines whether the number of communication-incapable nodes is equal to or more than the threshold ThN. In the condition of step S134, because the number of communication-incapable nodes is 1, the normal node 214 determines that the number of communication-incapable nodes is not equal to or more than the threshold ThN, and continues to engage in its operations. That is, other than the normal node 214, the normal node 224 assigned to the same identifier is normally operating and redundancy of the KVS data is therefore maintained. As a result, the normal node 214 continues to engage in its operations.

[Steps S135 and S136] The normal node 224 updates its own transaction history based on the not-yet-notified transaction records received from the normal node 214 (see FIG. 20). In addition, the normal node 224 applies unexecuted KVS transactions in the updated transaction history (KVS transactions corresponding to the not-yet-notified transaction records) to its own KVS data. Then, the normal node 224 continues to engage in its operations.

As described above, because, in the multiple distributed KVS system, there are a plurality of nodes assigned to the same identifier, operations are continued even if one or more nodes exit the system as long as redundancy of the KVS data is not lost. In addition, as a matter of course, the redundancy state of the multiple distributed KVS system may be improved when the redundancy has been reduced before the redundancy is completely lost. For example, the mechanism of the second embodiment may be modified in such a manner that, if the multiplicity of identifier spaces is W (W≥4), a process of restoring redundancy is performed when the number of nodes assigned to the same identifier is reduced to 2. That is, by selecting an appropriate value for the threshold ThN according to the multiplicity of identifier spaces, it is possible to suitably decrease the risk of losing the KVS data.

Next described is a processing sequence performed when the number of communication-incapable nodes has fallen below the threshold ThN (see FIG. 22).

[Steps S141 and S142] The normal nodes 224 and 234 exit.

[Steps S143 and S144] At the timing of performing synchronization, the normal node 214 transmits not-yet-notified transaction records to the normal nodes 224 and 234. In this regard, the normal node 214 refers to the same identifier node list and transmits the not-yet-notified transaction records to IP addresses of the normal nodes 224 and 234 assigned to the same identifier as that to which the normal node 214 is assigned. Note however that, because the normal nodes 224 and 234 have already exited, the not-yet-notified transaction records do not reach the normal nodes 224 and 234. Therefore, the normal node 214 obtains no acknowledgements of the not-yet-notified transaction records from the normal nodes 224 and 234.

[Step S145] The normal node 214 counts the number of nodes in a state incapable of communication (“the number of communication-incapable nodes”) according to whether an acknowledgment from each of the normal nodes 224 and 234 has been received. In this example, because no acknowledgements are obtained from the normal nodes 224 and 234, the number of communication-incapable nodes is 2. Then, the normal node 214 determines whether the communication-incapable nodes is equal to or more than the threshold ThN. In step S145 in FIG. 22, because the number of communication-incapable nodes is 2, the normal node 214 determines that the number of communication-incapable nodes is equal to or more than the threshold ThN. That is, other than the normal node 214, no other nodes assigned to the same identifier are operating normally, and redundancy of the KVS data has therefore been lost. In this case, the normal node 214 performs step S146 and the subsequent steps to deal with the situation.

[Step S146] The normal node 214 stops receiving KVS transaction requests.

[Step S147] The normal node 214 decides a destination node to which the functions of the normal node 214 are going to be transferred (an alternative node). For example, the normal node 214 searches for a node becoming newly responsible for keys currently assigned to the normal node 214 when the normal node 214 exits, and determines the node as the alternative node. Assuming in the example of FIG. 6 that the node with ID #4 exits, Key #3 and Key #4 assigned to the node with ID #4 are transferred to the node with ID #0. In this case, the normal node 214 determines the node with ID #0 (i.e., the initial node 210) as its alternative node. Note that KVS transaction requests made to the normal node 214 after the normal node 214 has stopped receiving them are transferred to the alternative node.

[Steps S148 and S149] The normal node 214 transfers its KVS data to the alternative node. Then, the normal node 214 notifies each node of its exit from the system, and also issues an entry request to the initial node 210. By issuing the entry request to the initial node 210, the normal node 214 is housed in the node pool 410.

As described above, each node assigned to the same identifier monitors the number of communication-incapable nodes in the synchronization process, and checks whether their multiplicity is maintained. Then, if the multiplicity is not sufficient and redundancy of the KVS data is therefore determined to have been reduced, control is exercised to cause a remaining node or nodes assigned to the identifier to exit and return to the node pool. If a sufficient number of nodes are in the node pool, a plurality of nodes are assigned to the same identifier and redundancy of the KVS data is thus restored. The synchronization and alive monitoring processing sequence has been described thus far.

[Node Re-Entry]

Next described is a sequence of re-entry and synchronization processing with reference to FIGS. 23 and 24. FIG. 23 illustrates the re-entry and synchronization processing according to the second embodiment. FIG. 24 is a sequence diagram illustrating the re-entry and synchronization processing sequence according to the second embodiment. The example of FIG. 23 depicts synchronization performed when the normal node 234 re-enters after having once exited. In the case where the normal node 234 is a mobile terminal, the normal node 234 may be temporarily brought into a state incapable of communication due to changes in the communication environment. In this case, the normal node 234 is determined to have exited, as illustrated in FIG. 21 (see steps S132 and S134).

If the normal node 234 after having temporarily exited is assigned to a new identifier and allowed to re-enter, access to the KVS data and the transaction history held in the normal node 234 is no longer available. Therefore, in the case where the normal node 234 returns to a normal communication state promptly after having temporarily gone into a state incapable of communication, it is possible to reduce burden on the system by allowing the normal node 234 to re-enter while assigning it to its original identifier and continue its operations using the KVS data and transaction history already held therein.

As explained with reference to FIG. 21, in the multiple distributed KVS system, even when, amongst nodes assigned to the same identifier, one or more nodes have exited, the remaining nodes continue to engage in their operations. In view of this, a node having temporarily exited is assigned back to its original identifier and allowed to re-enter when the remaining nodes are carrying on the operations, and synchronization of transaction histories is then performed to copy transactions updated during the node staying off the system as illustrated in FIG. 23. Herewith, it is possible to carry on the operations with the re-entering node.

In the example of FIG. 23, the normal node 234 having re-entered acquires, from the normal node 224 continuing the operations, the transaction history held therein. In this regard, the normal node 234 compares the transaction history acquired from the normal node 224 against its own transaction history to extract the difference between them. Then, the normal node 234 reflects the extracted difference in its own transaction history, and also reflects KVS transactions included in the difference in its own KVS data. Herewith, the KVS data is synchronized between the normal nodes 224 and 234.

Specifically, when the normal node 234 re-enters, the normal node 234 and the normal nodes 214 and 224 assigned to the same identifier as that to which the normal node 234 is assigned perform processing in the following sequence (see FIG. 24).

[Steps S151 and S152] The normal node 234 exits. Then, the normal node 234 re-enters. Note that a mechanism may be adopted which allows the re-entry only if the period between the exit and the re-entry is shorter than a predetermined period of time (for example, 1 second).

[Steps S153 and S154] The normal node 234 transmits a message to check the operational state to each of the normal nodes 214 and 224. In this regard, by referring to the same identifier node list, the normal node 234 transmits the messages to IP addresses of the normal nodes 214 and 224 assigned to the same identifier.

[Steps S155 and S156] Upon receiving the operational-state check messages from the normal node 234, the normal nodes 214 and 224 individually return an acknowledgement indicating the completion of the reception to the normal node 234. Note that, in this example, the normal nodes 214 and 224 are operating, and the acknowledgements of the operation-state check messages are therefore returned from the normal nodes 214 and 224 to the normal node 234. However, in the case where the normal nodes 214 and 224 have already exited as in the example of FIG. 22, no acknowledgements of the operation-state check messages are returned to the normal node 234. In this case, the normal node 234 ends the re-entry processing and then issues an entry request, for example, to the initial node 210.

[Step S157] The normal node 234 selects a node from which the normal node 234 is going to request transaction history synchronization (a synchronization destination). Note that the synchronization destination may be selected randomly or in order of priority determined in advance. For example, as the synchronization destination, the normal node 234 may preferentially select a node on a short RTT path from the normal node 234 by referring to its own RTT data, or select a node returning an acknowledgement in a short amount of time after the operational-state check is sent thereto. In the example of FIG. 24, the normal node 224 is selected.

[Step S158] The normal node 234 transmits a synchronization request to the normal node 224 selected as the synchronization destination.

[Step S159] Upon receiving the synchronization request from the normal node 234, the normal node 224 transmits the transaction history held therein to the normal node 234.

[Steps S160 and S161] The normal node 234 updates its own transaction history based on the transaction history received from the normal node 224. In addition, the normal node 234 applies unexecuted KVS transactions in the updated transaction history (KVS transactions corresponding to the differences in the transaction histories) to its own KVS data. After completing the processing up to step S161, the normal nodes 214, 224, and 234 then carry on their operations.

As described above, a node having temporarily exited is assigned to its original identifier, and the transaction history of the node is synchronized with that of another node assigned to the same identifier and then the KVS data is updated. Herewith, the multiple distributed KVS system is restored to the state before the node exit. Allowing such a re-entry saves the need for processes involved in the entry of a new node, such as restructuring of routing tables, key reassignment, and transfer of KVS data. As a result, even if nodes frequently repeat entering and exiting, it is possible to control a decrease in system performance. The re-entry and synchronization processing sequence has been described thus far.

[RTT Measurement]

Next described is a processing sequence taking place at the time of RTT measurement, with reference to FIG. 25. FIG. 25 is a flow diagram illustrating the processing sequence taking place at the time of RTT measurement according to the second embodiment. In the following example, let us assume that the initial node 210 performs the RTT measurement for the purpose of illustration.

[Step S171] By referring to the node pool information 241 f, the pool managing unit 244 selects a pair of nodes from the node pool 410.

[Step S172] The pool managing unit 244 measures the RTT between the nodes selected in step S171. For example, the pool managing unit 244 notifies one of the selected paired nodes of the IP address of the other node, and instructs the node to measure the RTT using ping, which is a piece of software used to test the reachability of a node in an IP network. Then, the pool managing unit 244 acquires the RTT from the node to which the instruction has been sent.

[Step S173] The pool managing unit 244 stores, in the storing unit 241, the paired nodes selected in step S171 in association with the RTT acquired in step S172 as the RTT data 241 g.

[Step S174] The pool managing unit 244 determines whether all possible pairs of nodes have been selected. If all the possible pairs of nodes have been selected, the pool managing unit 244 moves to step S175. On the other hand, if there is an unselected pair of nodes, the pool managing unit 244 moves to step S171.

[Step S175] With reference to the RTT data 241 g, the pool managing unit 244 identifies a set of nodes with RTT being mutually below a threshold ThT (for example, 100 milliseconds). The set of such nodes is referred to as the “neighboring node group”, and the process of identifying the neighboring node group is referred to as “clustering”.

For example, the pool managing unit 244 selects, from the node pool 410, as many nodes as the number of identifier spaces (multiplicity), and determines whether, for each pair of nodes out of the selected nodes, the RTT between the nodes is below the threshold ThT. Then, if each of the RTT's of all the pairs is below the threshold ThT, the pool managing unit 244 identifies the set of selected nodes as a neighboring node group (see FIG. 15). After the completion of step S175, a sequence of processing of FIG. 25 ends. The processing sequences taking place in the multiple distributed KVS system have been described thus far.

As described above, the multiple distributed KVS system prevents data loss caused by a node exit by providing multiple logical spaces, each of which is occupied by identifiers, and redundantly assigning nodes to the same identifier across the logical spaces to thereby implement redundancy of KVS data. In addition, even if one or more nodes amongst nodes assigned to the same identifier exit, the system operations are continued by the remaining nodes as long as the redundancy is maintained within an acceptable range.

Therefore, even if nodes frequently repeat exits, it is possible to reduce processing load imposed at the time of each exit and maintain stable system performance. In addition, when a node having temporarily exited re-enters, the node is assigned to its original identifier and the transaction history of the node is synchronized with that of another node assigned to the same identifier. This saves the need for recalculating routing tables even if nodes frequently repeat exits and re-entries, thus providing suitable maintenance of system performance. That is, the cost of updating routing tables and the cost of transferring data for synchronization are reduced, and applying the technique of the second embodiment to a system including a number of nodes frequently repeating entries and exits produces significant effects.

Note that, for the illustrative purposes, the above description uses Chord, which is a DHT protocol, to explain the rules of the logical space with identifiers mapped thereinto, a key search algorithm, and the like. However, the technique of the second embodiment is also applicable to other DHT's as well as a Skip Graph. That is, the structure of providing multiple logical spaces, the processing taking place when, amongst nodes assigned to the same identifier, one or more nodes have exited, and the processing taking place at the time of a node re-entry are applicable to other approaches in a similar fashion. Therefore, modifications adopting such approaches are also well within the technical scope of the second embodiment. The second embodiment has been described thus far.

According to one aspect, it is possible to control the risk of decreased system performance due to nodes likely to enter and exit frequently.

All examples and conditional language provided herein are intended for the pedagogical purposes of aiding the reader in understanding the invention and the concepts contributed by the inventor to further the art, and are not to be construed as limitations to such specifically recited examples and conditions, nor does the organization of such examples in the specification relate to a showing of the superiority and inferiority of the invention. Although one or more embodiments of the present invention have been described in detail, it should be understood that various changes, substitutions, and alterations could be made hereto without departing from the spirit and scope of the invention. 

What is claimed is:
 1. A non-transitory computer-readable storage medium storing an information management program that causes a processor of a computer including the processor and a memory to perform a procedure comprising: storing, in a management table that resides in the memory and is used to manage a system among a plurality of systems, each of which stores key-data pairs in the management table, the key-data pairs being distributed to a plurality of nodes, an identifier common to the systems, one or more keys assigned to the common identifier, and nodes assigned to the common identifier, the key-data pairs each including a key obtained by application of a predetermined function and data associated with the key; receiving a request transmitted from the nodes to enter the system, and housing temporarily the nodes in a node pool, the node pool housing a set of nodes each unassigned to any of the systems; keeping the nodes requesting entry waiting for assignment; and extracting, from the node pool, as many nodes kept waiting for assignment as a number of systems managed by the management table when a number of nodes housed in the node pool is equal to or larger than the number of systems, assigning, in association with an identifier common to the systems, each of the extracted nodes to a different one of the systems, assigning one or more keys to the common identifier, and then updating the management table according to the assigning of the extracted nodes and the assigning of the one or more keys.
 2. The non-transitory computer-readable storage medium according to claim 1, wherein the extracting includes monitoring, for each of all possible pairs of nodes housed in the node pool, an inter-node communication time taken for communication between paired nodes and extracting a group of nodes having a same identifier yielding a minimum sum of inter-node communication times.
 3. The non-transitory computer-readable storage medium according to claim 1, wherein: upon receiving a request for information corresponding to the key, a first node included in a first system amongst the systems identifies, based on the assigning of the extracted nodes, an identifier to which nodes holding the key linked to the information are assigned and makes an inquiry to a second node included in the first system and assigned to the identified identifier, and makes an inquiry, when no response is obtained from the second node, to a third node included in a second system amongst the systems, different from the first system, and assigned to the identified identifier.
 4. The non-transitory computer-readable storage medium according to claim 1, wherein the procedure further includes canceling, when a number of nodes each offering a response to an inquiry amongst the nodes assigned to the common identifier is below a predetermined threshold, assignment of all the nodes assigned to the common identifier and including, in the node pool, the nodes each offering the response.
 5. An information management method comprising: storing, by a processor of a computer including the processor and a memory, in a management table that resides in the memory and is used to manage a system among a plurality of systems, each of which stores key-data pairs in the management table, the key-data pairs being distributed to a plurality of nodes, an identifier common to the systems, one or more keys assigned to the common identifier, and nodes assigned to the common identifier, the key-data pairs each including a key obtained by application of a predetermined function and data associated with the key; receiving, by the processor, a request transmitted from the nodes to enter the system, and housing temporarily the nodes in a node pool, the node pool housing a set of nodes each unassigned to any of the systems; keeping, by the processor, the nodes requesting entry waiting for assignment; and extracting, by the processor, from the node pool, as many nodes kept waiting for assignment as a number of systems managed by the management table when a number of nodes housed in the node pool is equal to or larger than the number of systems, assigning, in association with an identifier common to the systems, each of the extracted nodes to a different one of the systems, assigning one or more keys to the common identifier, and then updating the management table according to the assigning of the extracted nodes and the assigning of the one or more keys.
 6. The information management method according to claim 5, wherein the computer is a management node for managing the systems, amongst the plurality of nodes.
 7. An information management apparatus comprising: a memory configured to store a management table used to manage a system among a plurality of systems, each of which stores key-data pairs in the management table, the key-data pairs being distributed to a plurality of nodes, the management table storing therein an identifier common to the systems, one or more keys assigned to the common identifier, and nodes assigned to the common identifier, the key-data pairs each including a key obtained by application of a predetermined function and data associated with the key; and a processor configured to perform a procedure including receiving a request transmitted from the nodes to enter the system, housing temporarily the nodes in a node pool, the node pool housing a set of nodes each unassigned to any of the systems, keeping the nodes requesting entry waiting for assignment, and extracting, from the node pool, as many nodes kept waiting for assignment as a number of systems managed by the management table when a number of nodes housed in the node pool is equal to or larger than the number of systems, assigning, in association with an identifier common to the systems, each of the extracted nodes to a different one of the systems, assigning one or more keys to the common identifier, and then updating the management table according to the assigning of the extracted nodes and the assigning of the one or more keys. 